On λ_1-extremal non-regular graphs
نویسندگان
چکیده
Let G be a connected non-regular graph with n vertices, maximum degree ∆ and minimum degree δ, and let λ1 be the greatest eigenvalue of the adjacency matrix of G. In this paper, by studying the Perron vector of G, it is shown that type-I-a graphs and type-I-b (resp. type-II-a) graphs with some specified properties are not λ1-extremal graphs. Moreover, for each connected non-regular graph some lower bounds on the difference between ∆ and λ1 are obtained.
منابع مشابه
Ela on Λ 1 - Extremal Non - Regular Graphs ∗
Let G be a connected non-regular graph with n vertices, maximum degree ∆ and minimum degree δ, and let λ1 be the greatest eigenvalue of the adjacency matrix of G. In this paper, by studying the Perron vector of G, it is shown that type-I-a graphs and type-I-b (resp. type-II-a) graphs with some specified properties are not λ1-extremal graphs. Moreover, for each connected non-regular graph some l...
متن کاملA note on the largest eigenvalue of non-regular graphs
The spectral radius of connected non-regular graphs is considered. Let λ1 be the largest eigenvalue of the adjacency matrix of a graph G on n vertices with maximum degree ∆. By studying the λ1-extremal graphs, it is proved that if G is non-regular and connected, then ∆− λ1 > ∆+ 1 n(3n+∆− 8) . This improves the recent results by B.L. Liu et al. AMS subject classifications. 05C50, 15A48.
متن کاملDet-extremal cubic bipartite graphs
Let G be a connected k–regular bipartite graph with bipartition V (G) = X ∪Y and adjacency matrix A. We say G is det–extremal if per(A) = |det(A)|. Det–extremal k–regular bipartite graphs exist only for k = 2 or 3. McCuaig has characterized the det–extremal 3–connected cubic bipartite graphs. We extend McCuaig’s result by determining the structure of det–extremal cubic bipartite graphs of conne...
متن کاملUniqueness of the extremal graph in the problem of maximizing the number of independent sets in regular graphs
The main purpose of this paper is to prove the uniqueness of a graph attaining the maximum of the number of independent sets over all $k$-regular graphs on $n$ vertices for $2k|n$.
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017